首页> 外文OA文献 >Efficiency enhancements for evolutionary capacity planning in distribution grids
【2h】

Efficiency enhancements for evolutionary capacity planning in distribution grids

机译:配电网中演进容量规划的效率增强

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

htmlabstractIn this paper, we tackle the distribution network expansion planning (DNEP) problem by employing two evolutionary algorithms (EAs): the classical Genetic Algorithm (GA) and a linkage-learning EA, specifically a Gene-pool Optimal Mixing Evolutionary Algorithm (GOMEA). We furthermore develop two efficiency-enhancement techniques for these two EAs for solving the DNEP problem: a restricted initialization mechanism to reduce the size of the explorable search space and a means to filter linkages (for GOMEA) to disregard linkage groups during genetic variation that are likely not useful. Experimental results on a benchmark network show that if we may assume that the optimal network will be very similar to the starting network, restricted initialization is generally useful for solving DNEP and moreover it becomes more beneficial to use the simple GA. However, in the more general setting where we cannot make the closeness assumption and the explorable search space becomes much larger, GOMEA outperforms the classical GA.
机译:htmlabstract在本文中,我们通过采用两种进化算法(EA)来解决配电网扩展规划(DNEP)问题:经典遗传算法(GA)和链接学习EA,特别是基因池最佳混合进化算法(GOMEA) 。我们还针对这两种EA开发了两种效率增强技术来解决DNEP问题:一种受限的初始化机制,以减少可探索的搜索空间的大小;以及一种过滤链接的方法(对于GOMEA),以免在遗传变异期间忽略链接组。可能没有用。在基准网络上的实验结果表明,如果我们可以假设最佳网络与起始网络非常相似,则受限初始化通常可用于解决DNEP,而且使用简单GA会变得更加有益。但是,在更一般的情况下,我们无法做出近似假设,并且可探索的搜索空间变得更大,GOMEA的性能优于经典GA。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号